Chordal graph - PDFSEARCH.IO - Document Search Engine

Chordal graph
Results: 143

#	Item
31	Parameterized Complexity of the Weighted Independent Set Problem beyond Graphs of Bounded Clique Number∗† Konrad Dabrowski1 , Vadim Lozin1‡, Haiko M¨ uller2 , and Dieter Rautenbach3 1 Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2012-04-30 01:44:46 NP-complete problems Chordal graph Bipartite graph Clique problem Interval graph Claw-free graph Clique Graph minor Perfect graph Split graph Independent set Graph
32	Jump Number of Two-Directional Orthogonal Ray Graphs Jose´ A. Soto1 1 Department 2 Operations Add to Reading List Source URL: www.dim.uchile.cl Language: English - Date: 2013-08-08 17:44:22 Graph theory Permutation graph Bipartite dimension Matching Bipartite graph Complete bipartite graph Chordal bipartite graph
33	Reconfiguring Independent Sets in Claw-Free Graphs∗ Paul Bonsma† Marcin Kami´ nski‡ Add to Reading List Source URL: rutcor.rutgers.edu Language: English - Date: 2015-07-28 10:23:00 NP-complete problems Graph operations Graph coloring Line graph Dominating set Claw-free graph Chordal graph Graph Neighbourhood Independent set Matching Median graph
34	tria-free-after-review14.dvi Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2012-04-30 01:42:59 NP-complete problems Graph operations Graph coloring Graph theory Line graph Clique Chordal graph Neighbourhood Planar graph Vertex Triangle-free graph Dominating set
35	Prof. Dr. Petra Scheffler FH Stralsund, FB Wirtschaft Publikationsverzeichnis 1. Add to Reading List Source URL: scheffler.fh-stralsund.de Language: English - Date: 2009-09-22 08:49:28 Scheffler Pathwidth Chordal graph Interval graph Graph
36	Nonlinear Graph Sparsification for SLAM Mladen Mazuran Gian Diego Tipaldi Luciano Spinello Add to Reading List Source URL: europa2.informatik.uni-freiburg.de Language: English - Date: 2014-10-22 05:13:51 Graph theory Spanning tree Dense graph Chordal graph Sparse matrix Line graph
37	Decomposition by maximal cliques and forbidden subgraphs for path graphs Hugo Nobrega1 COPPE/Engenharia de Sistemas e Computa¸ca ˜o Universidade Federal do Rio de Janeiro Add to Reading List Source URL: dl.dropboxusercontent.com Language: English Graph theory Graph operations Graph coloring Chordal graph Graph minor Cograph Intersection graph RobertsonSeymour theorem Forbidden graph characterization Clique Pathwidth Line graph
38	b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ∗ Flavia Bonomo1 , Oliver Schaudt2 , Maya Stein3 , and Mario Valencia-Pabon†4 1 Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2014-02-09 09:55:11 Graph theory Graph coloring Matching NP-complete problems Combinatorial optimization Graph operations Blossom algorithm Bipartite graph Chordal graph Complete coloring Cograph Ear decomposition
39	Fixed-Parameter Tractability of Token Jumping on Planar Graphs arXiv:1406.6567v2 [cs.DM] 11 MarTakehiro Ito1 , Marcin Kami´ Add to Reading List Source URL: arxiv.org Language: English - Date: 2015-03-11 21:08:35 Graph theory NP-complete problems Planar graphs Independent set Graph Matching Ear decomposition Clique Bipartite graph Line graph Chordal graph